Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

Q is empty.


↳ QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

The set Q consists of the following terms:

app2(app2(mapt, x0), app2(leaf, x1))
app2(app2(mapt, x0), app2(node, x1))
app2(app2(maptlist, x0), nil)
app2(app2(maptlist, x0), app2(app2(cons, x1), x2))


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(f, x)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(app2(mapt, f), x))
APP2(app2(mapt, f), app2(node, xs)) -> APP2(node, app2(app2(maptlist, f), xs))
APP2(app2(mapt, f), app2(node, xs)) -> APP2(maptlist, f)
APP2(app2(mapt, f), app2(node, xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(mapt, f)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(leaf, app2(f, x))
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(mapt, f), x)

The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

The set Q consists of the following terms:

app2(app2(mapt, x0), app2(leaf, x1))
app2(app2(mapt, x0), app2(node, x1))
app2(app2(maptlist, x0), nil)
app2(app2(maptlist, x0), app2(app2(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(f, x)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(app2(mapt, f), x))
APP2(app2(mapt, f), app2(node, xs)) -> APP2(node, app2(app2(maptlist, f), xs))
APP2(app2(mapt, f), app2(node, xs)) -> APP2(maptlist, f)
APP2(app2(mapt, f), app2(node, xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(mapt, f)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(leaf, app2(f, x))
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(mapt, f), x)

The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

The set Q consists of the following terms:

app2(app2(mapt, x0), app2(leaf, x1))
app2(app2(mapt, x0), app2(node, x1))
app2(app2(maptlist, x0), nil)
app2(app2(maptlist, x0), app2(app2(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 6 less nodes.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(f, x)
APP2(app2(mapt, f), app2(node, xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(mapt, f), x)

The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

The set Q consists of the following terms:

app2(app2(mapt, x0), app2(leaf, x1))
app2(app2(mapt, x0), app2(node, x1))
app2(app2(maptlist, x0), nil)
app2(app2(maptlist, x0), app2(app2(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(mapt, f), app2(leaf, x)) -> APP2(f, x)
APP2(app2(mapt, f), app2(node, xs)) -> APP2(app2(maptlist, f), xs)
APP2(app2(maptlist, f), app2(app2(cons, x), xs)) -> APP2(app2(mapt, f), x)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
APP2(x1, x2)  =  x2
app2(x1, x2)  =  app2(x1, x2)
maptlist  =  maptlist
cons  =  cons
mapt  =  mapt
leaf  =  leaf
node  =  node

Lexicographic Path Order [19].
Precedence:
app2 > [maptlist, mapt, node]


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ QDPOrderProof
                ↳ QDP
                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(mapt, f), app2(leaf, x)) -> app2(leaf, app2(f, x))
app2(app2(mapt, f), app2(node, xs)) -> app2(node, app2(app2(maptlist, f), xs))
app2(app2(maptlist, f), nil) -> nil
app2(app2(maptlist, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(app2(mapt, f), x)), app2(app2(maptlist, f), xs))

The set Q consists of the following terms:

app2(app2(mapt, x0), app2(leaf, x1))
app2(app2(mapt, x0), app2(node, x1))
app2(app2(maptlist, x0), nil)
app2(app2(maptlist, x0), app2(app2(cons, x1), x2))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.